An improved general E-unification method
نویسندگان
چکیده
منابع مشابه
An Improved General E-Unification Method
A generalization of Paramodulation is deened and shown to lead to a complete E-uniication method for arbitrary equational theories E. The method is deened in terms of transformations on systems, building upon and reening results of Gallier and Snyder.
متن کاملA Refined Version of General E-Unification
Transformation-based systems for general E-unification were first investigated by Gallier and Snyder. Their system extends the well-known rules for syntactic unification by Lazy Paramodulation, thus coping with the equational theory. More recently, Dougherty and Johann improved on this method by giving a restriction of the Lazy Paramodulation inferences. In this paper, we show that their system...
متن کاملComplete Sets of Transformations for General E-Unification
This paper is concerned with E-unification in arbitrary equational theories. We extend the method of transformations on systems of terms, developed by Martelli-Montanari for standard unification, to Eunification by giving two sets of transformations, BT and T, which are proved to be sound and complete in the sense that a complete set of E-unifiers for any equational theory E can be enumerated b...
متن کاملGoal-Directed E-Unification
We give a general goal directed method for solving the Eunification problem. Our inference system is a generalization of the inference rules for Syntactic Theories, except that our inference system is proved complete for any equational theory. We also show how to easily modify our inference system into a more restricted inference system for Syntactic Theories, and show that our completeness tec...
متن کاملImplementing rigid e-unification
Rigid E-unification problems arise naturally in automated theorem provers that deal with equality. While there is a lot of theory about rigid E-unification, only few implementations exist. Since the problem is NPcomplete, direct implementations of the theory are slow. In this paper we discuss how to implement a rigid E-unifier, focussing on efficiency. First, we introduce an efficient represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1992
ISSN: 0747-7171
DOI: 10.1016/0747-7171(92)90010-2